Upper and lower bounds for numerical radii of block shifts

Authors

  • H.-L. Gau Department of Mathematics, National Central University, Chun-gli 32001, Taiwan.
  • P. Y. Wu Department of Applied Mathematics, National Chiao Tung University, Hsinchu 30010, Taiwan.
Abstract:

For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine when either of them becomes an equality.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

upper and lower bounds for numerical radii of block shifts

for an n-by-n complex matrix a in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of a. in this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

full text

Upper and lower bounds of symmetric division deg index

Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...

full text

Lower Bounds and Upper Bounds for MaxSAT

This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is init...

full text

Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures

The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices which occupies minute space (FM-indexes) and wavelet trees. These data structures also can be used to represent labeled trees and posting lists. Labeled trees are applied in XM...

full text

Upper Bounds for Packings of Spheres of Several Radii

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for pa...

full text

upper and lower bounds of symmetric division deg index

symmetric division deg index is one of the 148 discrete adriatic indices that showed good predictive properties on the testing sets provided by international academy of mathematical chemistry.symmetric division deg index is defined by$$sdd(g) = sume left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right),$$where $d_i$ is the degree of vertex $i$ in graph $g$.in this pap...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 41  issue Issue 7 (Special Issue)

pages  15- 27

publication date 2015-12-01

{@ msg @}

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023